LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
نویسندگان
چکیده
منابع مشابه
Supporting Efficient Recursive Query Processing in DHTs
Although various approaches have been proposed to process complex queries, such as range queries, join queries, aggregate queries and etc., in Peer-to-Peer data management research, we find currently there are no efficient techniques to support linear recursive queries, which is also one indispensable types of queries and exhibits crucial importance in many scenarios. In this paper, we propose ...
متن کاملContinuous RDF Query Processing over DHTs
We study the continuous evaluation of conjunctive triple pattern queries over RDF data stored in distributed hash tables. In a continuous query scenario network nodes subscribe with long-standing queries and receive answers whenever RDF triples satisfying their queries are published. We present two novel query processing algorithms for this scenario and analyze their properties formally. Our pe...
متن کاملEfficient range query processing over DHTs based on the balanced Kautz tree
Distributed Hash Tables (DHTs) are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for hosting large-scale distributed applications. The ever-wider use of DHT infrastructures has found more and more applications that require support for range queries. Recently, a number of DHT-based range query schemes have been proposed. However, mo...
متن کاملIndexing land surface for efficient kNN query
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, with the recent advances in remote sensory devices that can acquire detailed elevation data, the new geospatial applications heavily operate on this third dimension, i.e., land surface. Hence, for the field of database...
متن کاملEfficient Indexing for Diverse Query Results
This paper examines the problem of computing diverse query results which is useful for browsing search results in online shopping applications. The search results are diversified wrt a sequence of output attributes (termed d-order) where an attribute that appears earlier in the d-order has higher priority for diversification. We present a new indexing technique, D-Index, to efficiently compute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2010
ISSN: 1041-4347
DOI: 10.1109/tkde.2009.47